The Full Surplus Extraction Theorem with Hidden Actions
نویسنده
چکیده
I consider a situation in which a principal commits to a mechanism first and then agents choose unobservable actions before they draw their types. The agents’ actions affect not only their payoffs directly but also a distribution of private types as well. Thus, the distribution of types is determined endogenously rather than exogeneously unlike standard mechanism design literature. Then I extend Cremer and McLean’s full surplus extraction theorem [10] to such a setting, that is, identify a necessary and sufficient condition on the information structure for the full surplus extration. More importantly, it implies that the full surplus extraction may not be obtained for generic set of information structure in this more general setting. This contrasts with the standard full surplus extraction theorem which holds generically. I show, however, that the principal can extract all the surplus for any completely mixed action profile for almost all information structure by using more general mechanisms in which agents announce both their types and the realizations of their mixed actions. Since any pure action profile can be arbitrarily approximated by a completely mixed action profile, the principal can virtually extracts all the maximized social surplus. JEL classification: C72, D44, D82
منابع مشابه
The generic possibility of full surplus extraction in models with large type spaces
McAfee and Reny (1992) have given a necessary and sufficient condition for full surplus extraction in naive type spaces with a continuum of payoff types. We generalize their characterization to arbitrary abstract type spaces and to the universal type space and show that in each setting, full surplus extraction is generically possible. We interpret the McAfee-Reny condition as a much stronger ve...
متن کاملThe Genericity of the McAfee-Reny Condition for Full Surplus Extraction in Models with a Continuum of Types
McAfee and Reny (1992) have given a necessary and sufficient condition for full surplus extraction in models with a continuum of types. In this paper we show that it is satisfied by a generic set of model specifications. We extend the classical embedding theorem for continuous functions to account for a stronger geometric condition on the functions mapping abstract types into beliefs which is b...
متن کاملSurplus Extraction on Arbitrary Type Spaces
In this paper I study the possibility of full surplus extraction on arbitrary type spaces, with three main results: (i) I characterize full surplus extraction, (ii) I characterize full surplus extraction assuming that the surplus-extracting allocation is implementable, and (iii) I show that virtually full surplus extraction implies full surplus extraction. The characterizing condition in (ii) a...
متن کاملOn the Generic (Im)possibility of Full Surplus Extraction in Mechanism Design∗
A number of studies, most notably Crémer and McLean (1985, 1988), have shown that in generic type spaces that admit a common prior and are of a fixed finite size, an uninformed seller can design mechanisms that extract all the surplus from privatelyinformed bidders. We show that this result hinges on the non-convexity of such a family of priors. When the ambient family of priors is convex, gene...
متن کاملExtraction of the Surplus in Standard Auctions
Crémer and McLean [1] and McAfee and Reny [3] showed that, in “nearly all auctions”, the seller can offer a mechanism that obtains full rent extraction. The mechanism designed by Crémer and McLean differs from standard procedures in several respects. Notably, (a) bidders are required to buy “lotteries” in order to partecipate at the auction; (b) bidders are treated non-anonymously, in the sense...
متن کامل